An algorithm for score aggregation over causal biological networks based on random walk sampling
نویسندگان
چکیده
منابع مشابه
Random sampling: Billiard Walk algorithm
Hit-and-Run is known to be one of the best random sampling algorithms, its mixing time is polynomial in dimension. Nevertheless, in practice the number of steps required to achieve uniformly distributed samples is rather high. We propose new random walk algorithm based on billiard trajectories. Numerical experiments demonstrate much faster convergence to uniform distribution.
متن کاملDRWT: An Efficient Random Walk Algorithm for Unstructured P2P Networks
In this paper, we present a novel search algorithm called Dynamic Random Walk Team (DRWT), which achieves a better tradeoff between performance and overhead. The main difference between DRWT and the traditional Random Walk algorithms contains two aspects: (1) all nodes advertise their resource sharing information and maintain and broadcast the information with the EDBF-like manner, which discar...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملRandom walk on disordered networks
Random walks are studied on disordered cellular networks in 2-and 3dimensional spaces with arbitrary curvature. The coefficients of the evolution equation are calculated in term of the structural properties of the cellular system. The effects of disorder and space-curvature on the diffusion phenomena are investigated. In disordered systems the mean square displacement displays an enhancement at...
متن کاملAn Improved Random Walk Based Community Detection Algorithm
Community detection is an important issue in social network analysis, which aims at finding potential community structures such that the internal nodes of a community have higher closeness than external nodes. Taking into account node attribute information, this paper presents an improved community detection algorithm based on random walk. Based on the basic understanding that people getting to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Research Notes
سال: 2014
ISSN: 1756-0500
DOI: 10.1186/1756-0500-7-516